A Simple Systolic Algorithm for Generating Combinations in Lexicographic Order
نویسنده
چکیده
A systolic algorithm is described for generating, in lexicographlcally ascending order, all combinations of m objects chosen from {1 .... ,n). The algorithm is designed to he executed on a linear array of m processors, each having constant size memory, and each being responsible for producing one dement of a given combination. There is a constant delay per combination, leading to an O(C(m, n)) time solution, where C(m, n) is the total number of combinations. The algorithm is cost optimal (assttmlnwf the time to output the combinations is counted), does not deal with very large integers, and is much simpler than the previously known solutions that enjoy same properties.
منابع مشابه
Lexicographic Listing and Ranking of r-ary Trees
This paper presents three simple and efficient algorithms for generating, ranking and unranking t-ary trees in a lexicographic order. The simplest idea of encoding a t-ary tree with n nodes as a bit-string of length t*n is exploited to its full advantages. It is proved that the lexicographic order in the set of t-ary trees with n nodes is preserved in the set of bit-strings of length t*n, using...
متن کاملLexicographic Listing and Ranking of t-Ary Trees
This paper presents three simple and efficient algorithms for generating, ranking and unranking t-ary trees in a lexicographic order. The simplest idea of encoding a t-ary tree with n nodes as a bit-string of length t*n is exploited to its full advantages. It is proved that the lexicographic order in the set of t-ary trees with n nodes is preserved in the set of bit-strings of length t*n, using...
متن کاملSystolic Generation of combinations from Arbitrary Elements
A systolic algorithm is described for generating, in lexicographically ascending order, all combinations of rn o$ects chosen from an arbitrary set of n elements. The algorithm is designed to be executed on a linear array of zn processors, each having consta.nt size memory (except processor rn, which has O(n) memory), and each being responsible fot producing one element of a given combination. T...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کامل